Closed Subgroups of Lattice-Ordered Permutation Groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex $L$-lattice subgroups in $L$-ordered groups

In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...

متن کامل

On fuzzy convex lattice-ordered subgroups

In this paper, the concept of fuzzy convex subgroup (resp. fuzzy convex lattice-ordered subgroup) of an ordered group (resp. lattice-ordered group) is introduced and some properties, characterizations and related results are given. Also, the fuzzy convex subgroup (resp. fuzzy convex lattice-ordered subgroup) generated by a fuzzy subgroup (resp. fuzzy subsemigroup) is characterized. Furthermore,...

متن کامل

Convex L-lattice subgroups in L-ordered groups

In this paper, we have focused to study convex L-subgroups of an Lordered group. First, we introduce the concept of a convex L-subgroup and a convex L-lattice subgroup of an L-ordered group and give some examples. Then we find some properties and use them to construct convex L-subgroup generated by a subset S of an L-ordered group G . Also, we generalize a well known result about the set of all...

متن کامل

Permutation groups and normal subgroups

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of 'basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the traditional choice for this purpose, but some combinatorial applications require different kinds of basic groups, such as quasiprimitive groups, that are defined by...

متن کامل

Cycle-Closed Permutation Groups

A finite permutation group is cycle-closed if it contains all the cycles of all of its elements. It is shown by elementary means that the cycle-closed groups are precisely the direct products of symmetric groups and cyclic groups of prime order. Moreover, from any group, a cycle-closed group is reached in at most three steps, a step consisting of adding all cycles of all group elements. For inf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1972

ISSN: 0002-9947

DOI: 10.2307/1996276